Rewriting of Graphs through thePullback
نویسنده
چکیده
We continue here the development of our description of the pullback approach to graph rewriting-already shown to encompass both the NCE and the double-pushout approach, by describing parallel application of rewriting rules. We show that this new framework provides a genuine deenition of parallel rewriting (parallel application of several rewriting rules at several diierent places in the graph is actually expressed through the application of one single mathematical operation) and even further that a deterministic graph grammar can be described by a single rule which we call P-grammar.
منابع مشابه
Decomposing Graphs with Symmetries
While decomposing graphs in simpler items greatly helps to design more efficient algorithms, some classes of graphs can not be handled using the classical techniques. We show here that a graph having enough symmetries can be factored into simpler blocks through a standard morphism and that the inverse process may be formalized as a pullback rewriting system.
متن کاملRewriting Systems over Unranked Trees
Finite graphs constitute an important tool in various fields of computer science. In order to transfer the theory of finite graphs at least partially to infinite systems, a finite representation of infinite systems is needed. Rewriting systems form a practical model for the finite representation of infinite graphs. Among attractive subclasses of rewriting systems is the class of ground tree rew...
متن کاملPORGY: A Visual Graph Rewriting Environment for Complex Systems
Graph rewriting systems (GRSs) operate on graphs by substituting local patterns according to a set of rewriting rules. The apparent simplicity of GRSs hides an incredible complexity and turns the study of these systems into an involved task requiring high-level expertise. We designed PORGY, an interactive visual environment to fully support GRSs related tasks, exploiting a long historical tradi...
متن کاملParallel rewriting of graphs through the pullback approach
We continue here the development of our description of the pullback approach to graph rewriting-already shown to encompass both the NCE and the double-pushout approach, by describing parallel application of rewriting rules. We show that this new framework provides a genuine deenition of parallel rewriting (parallel application of several rewriting rules at several diierent places in the graph i...
متن کاملTransition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transitiongraphs that are generated by rewriting systems over unranked trees. Twokinds of such rewriting systems are studied. For the first, we construct areduction to ranked trees via an encoding and to standard ground treerewriting, thus showing that the generated classes of transition graphscoincide. In the second rewritin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995